Parameterized complexity - PDFSEARCH.IO - Document Search Engine

Parameterized complexity
Results: 172

#	Item
51	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
52	Keeping a Crowd Safe: On the Complexity of Parameterized Verification Monday, March 2nd, :00am Auditorium 106 at New IIS Building Add to Reading List Source URL: www.iis.sinica.edu.tw Language: English - Date: 2015-01-08 03:33:45 Complex systems theory Complexity Holism Systems Transdisciplinarity Computer science Communications protocol Science Data Information Abstraction
53	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
54	A Soft Constraint of Equality: Complexity and Approximability? Emmanuel Hebrard, Barry O’Sullivan, and Igor Razgon Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland {e. Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:30 Mathematics Local consistency Constraint satisfaction Constraint optimization Mathematical optimization Static single assignment form FO Variable Parameterized complexity Constraint programming Software engineering Theoretical computer science
55	Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V -polytope Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:48 Convex polytope Abstract polytope Geometry Polytopes Simplex
56	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
57	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics
58	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
59	The Parameterized Complexity of Global Constraints∗ C. Bessiere LIRMM Montpellier, France Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:28 Computer programming Local consistency Constraint satisfaction Constraint logic programming Parameterized complexity Mathematical optimization Clique problem Decomposition method Complexity of constraint satisfaction Constraint programming Theoretical computer science Software engineering
60	Structural Decomposition Methods and What They are Good For Markus Aschinger1 , Conrad Drescher1 , Georg Gottlob1,2 , Peter Jeavons1 , and Evgenĳ Thorstensen1 1 Computing Laboratory, University of Oxford 2 Oxford Man In Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:11 Graph operations Tree decomposition Decomposition method Path decomposition Parameterized complexity Constraint satisfaction problem Bipartite graph Hypertree Hypergraph Graph theory Theoretical computer science Constraint programming

UPDATE